Identifying and Locating Complete Psychosocial Instruments

Identifying and computing temporal locating adverbials

.......................................................................................................................... xi Resumo ......................................................................................................................... xiii Foreword ...................................................................................................................... xvii PART...

Locating-domination and identifying codes in trees

Locating and Identifying Codes in Circulant Networks

A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words S is dominating if the sets S ∩N [u] where u ∈ V (G) and N [u] denotes the closed neighbourhood of u in G, are all nonempty. A set S ⊆ V (G) is called a locating code in G, if the sets S ∩ N [u] where u ∈ V (G) \ S are all nonempty and distinct. A set S ⊆ V ...

Identifying and Locating- Dominating Codes in Binary Hamming Spaces Identifying and Locating-Dominating Codes in Binary Hamming Spaces

Acknowledgements First of all I want to thank my supervisor Professor Iiro Honkala for his continuous support, and patience when long breaks in research took place. Many discussions with Iiro, his collaboration, suggestions for research topics, and careful proofreading made this work possible. I also want to thank Dr. Tero Laihonen for many inspiring discussions, suggestions for research topics...

Identifying codes and locating-dominating sets on paths and cycles

Let G = (V,E) be a graph and let r ≥ 1 be an integer. For a set D ⊆ V , define Nr[x] = {y ∈ V : d(x, y) ≤ r} and Dr(x) = Nr[x] ∩ D, where d(x, y) denotes the number of edges in any shortest path between x and y. D is known as an r-identifying code (r-locating-dominating set, respectively), if for all vertices x ∈ V (x ∈ V \D, respectively), Dr(x) are all nonempty and different. In this paper, w...